Learning to Search: From Weak Methods to Domain-Specific Heuristics

نویسنده

  • Pat Langley
چکیده

Learning from experience involves three distinct components — generating behavior, assigning credit, and modifying behavior. We discuss these components in the context of learning search heuristics, along with the types of learning that can occur. We then focus on SAGE, a system that improves its search strategies with practice. The program is implemented as a production system, and learns by creating and strengthening rules for proposing moves. SAGE incorporates five different heuristics for assigning credit and blame, and employs a discrimination process to direct its search through the space of rules. The system has shown its generality by learning heuristics for directing search in six different task domains. In addition to improving its search behavior on practice problems, SAGE is able to transfer its expertise to scaled-up versions of a task, and in one case transfers its acquired search strategy to problems with different initial and goal states.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

متن کامل

An integrated approach for scheduling flexible job-shop using teaching–learning-based optimization method

In this paper, teaching–learning-based optimization (TLBO) is proposed to solve flexible job shop scheduling problem (FJSP) based on the integrated approach with an objective to minimize makespan. An FJSP is an extension of basic job-shop scheduling problem. There are two sub problems in FJSP. They are routing problem and sequencing problem. If both the sub problems are solved simultaneously, t...

متن کامل

Kernel Regression for Planning Heuristics

Modern automated planning revolves around forward state-space heuristic search. These planners guide their search with powerful domain-independent heuristics that estimate the distance to a goal state by efficiently solving related, but simplified, planning problems. This approximation trades off efficiently with approximation quality. In the past 15 years, the Planning and Learning community h...

متن کامل

Learning with Genetic Algorithms: An Overview

Genetic algorithms represent a class of adaptive search techniques that have been intensively studied in recent years, Much of the interest in genetic al­ gorithms is due to the fact that they provide a set of efficient domain-independent search heuristics which are a significant improvement over traditional "weak meth­ ods" without the need for incorporating highly domain-specific knowledge. T...

متن کامل

Combining Weak Learning Heuristics in General Problem Solvers

This paper is concerned with state space problem solvers that achieve generality by learning strong heuristics through experience in a particular domain. We specif ically consider two ways of learning by analysing past solutions that can improve future problem solving: creating macros and the chunks. A method of learning search heuristics is specified which is related to 'chunking' but which co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Cognitive Science

دوره 9  شماره 

صفحات  -

تاریخ انتشار 1985